Counting with rational generating functions
نویسندگان
چکیده
منابع مشابه
Counting with rational generating functions
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input variables of the (quasi-polynomial) function are fixed, there is a polynomial time algorithm which converts between the two representations. Examples of such countin...
متن کاملCounting numerical Semigroups with Short Generating Functions
This paper presents a new methodology to compute the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius number) and multiplicity. First, we give theoretical results about the polynomial-time complexity of counting these semigroups. We also illustrate the met...
متن کاملCounting Real Rational Functions with All Real Critical Values
We study the number ♯ n of real rational degree n functions (considered up to a linear fractional transformation of the independent variable) with a given set of 2n − 2 distinct real critical values. We present a combinatorial interpretation of these numbers and pose a number of related questions.
متن کاملRational Generating Functions and Integer Programming Games
We explore the computational complexity of computing pure Nash equilibria for a new class of strategic games called integer programming games with difference of piecewise linear convex payoffs. Integer programming games are games where players’ action sets are integer points inside of polytopes. Using recent results from the study of short rational generating functions for encoding sets of inte...
متن کاملA Tutorial on Rational Generating Functions
Many of the positive results in this paper are derived from results from the literature on rational generating functions and in particular from the method of Barvinok and Woods [2]. Generating functions have been applied in an analogous fashion in a variety of other contexts, including social choice theory [7], discrete optimization [6], combinatorics [4], and compiler optimization [8]. We here...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2008
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2007.07.007